Searching trademark databases for verbal similarities
نویسنده
چکیده
We review various issues related to techniques for searching through collections of trademarks for phonetic and other verbal similarities. Based on recent case studies, we survey judicial arbitrations that have established whether trademarks are similar or not and comment on popular algorithms for performing approximate searches, both phonetically and based on letter sequences. The particularities of international registrations and multilingual trademarks are also discussed. Overall, fuzzy searching for verbal similarities is a difficult task that calls for a cautious attitude. No solution can guarantee a fully automatic procedure. A manual validation of results will always need to be performed. 2005 Published by Elsevier Ltd.
منابع مشابه
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs.
The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and statistical refinements described here permits the execution time of the BLAST programs to be decreased substantially while enhancing their sensitivity to weak similarities. A new criterion for triggering the extension of...
متن کاملGapped BLAST and PSLBLAST: a new generation of protein database search programs
The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and statistical refinements described here permits the execution time of the BLAST programs to be decreased substantially while enhancing their sensitivity to weak similarities. A new criterion for triggering the extension ...
متن کاملSSMAL: similarity searching with alignment graphs
MOTIVATION We want to provide biologists with a fast and sensitive scanning tool for searching local alignments of a protein query sequence against databases of protein multiple alignments, such as ProDom. Conversely, we want to provide a tool for locally aligning a protein multiple alignment query against a protein database such as SWISSPROT. RESULTS We developed the program SSMAL (Shuffling...
متن کاملEffective detection of remote homologues by searching in sequence dataset of a protein domain fold.
Profile matching methods are commonly used in searches in protein sequence databases to detect evolutionary relationships. We describe here a sensitive protocol, which detects remote similarities by searching in a specialized database of sequences belonging to a fold. We have assessed this protocol by exploring the relationships we detect among sequences known to belong to specific folds. We fi...
متن کاملProtein family classification based on searching a database of blocks.
The most highly conserved regions of proteins can be represented as "blocks" of locally aligned sequence segments. Previously, an automated system was introduced to generate a database of blocks that is searched for local similarities using a sequence query. Here, we describe a method for searching this database that can also reveal significant global similarities. Local and global alignments a...
متن کامل